Markov Decision Processes for Services Opportunity Pipeline Optimization
نویسندگان
چکیده
The dynamics of sales opportunities can be modelled by a Markov Decision Process. The latter can be solved using dynamic programming and assigns to each state an optimal action. In this project, states are modelled by the number of opportunities at five different maturity levels called ranks, actions are represented by investments and rewards by profits from signed contracts. Transitions are simulated using the probabilities that an opportunity moves from one rank to another. Two different types of policy appear recurrently in the model outcome, i.e. a low-investment policy when the opportunities are rather uniformly distributed across ranks and a high-investment policy, when a larger number of opportunities have reached mature status or have just entered the pipe. Acknowledgements I would like to thank Dr. Gianluca Antonini for his help with this project and for making corrections to the present report, and Stefan Woerner for his help on the modelling part.
منابع مشابه
Configuration and adaptation of semantic web processes
In this paper, we present the METEOR-S framework for configuration and adaptation of Semantic Web processes. This paper shows how semantic descriptions of Web services can be used to facilitate Web process configuration and adaptation. For configuration, we present an approach that uses domain knowledge captured using ontologies, in conjunction with a well known optimization technique (Integer ...
متن کاملAccelerated decomposition techniques for large discounted Markov decision processes
Many hierarchical techniques to solve large Markov decision processes (MDPs) are based on the partition of the state space into strongly connected components (SCCs) that can be classified into some levels. In each level, smaller problems named restricted MDPs are solved, and then these partial solutions are combined to obtain the global solution. In this paper, we first propose a novel algorith...
متن کاملContinuous-time MAXQ Algorithm for Web Service Composition
Web services composition present a technology to compose complex service applications from individual (atomic) services, that is, through web services composition, distributed applications and enterprise business processes can be integrated by individual service components developed independently. In this paper, we concentrate on the optimization problems of dynamic web service composition, and...
متن کاملRegret optimality in semi-Markov decision processes with an absorbing set
The optimization problem of general utility case is considered for countable state semi-Markov decision processes. The regret-utility function is introduced as a function of two variables, one is a target value and the other is a present value. We consider the expectation of the regret-utility function incured until the reaching time to a given absorbing set. In order to characterize the regret...
متن کاملINVERSE FREQUENCY RESPONSE ANALYSIS FOR PIPELINES LEAK DETECTION USING THE PARTICLE SWARM OPTIMIZATION
Inverse Transient Analysis (ITA) is a powerful approach for leak detection of pipelines. When the pipe transient flow is analyzed in frequency domain the ITA is called Inverse Frequency Response Analysis (IFRA). To implement an IFRA for leak detection, a transient state is initiated in the pipe by fast closure of the downstream end valve. Then, the pressure time history at the valve location is...
متن کامل